MAL Machines and their Languages , Spring 2015

First construct a table over all pairs of distinct states. That is, we do not consider pairs (p ∈ Q, p ∈ Q) since a state obviously cannot be distinguishable from itself. An easy way of doing this is to order the states (e.g. numerically or alphabetically), and then list all states except the last one in ascending order along the top line, and all states except the first one in descending order down the left-hand side of the table. The resulting table for the given DFA with Q = {0, 1, 2, 3, 4} looks like this: